Exterior Pairs and Up Step Statistics on Dyck Paths

نویسندگان

  • Sen-Peng Eu
  • Tung-Shan Fu
چکیده

Let Cn be the set of Dyck paths of length n. In this paper, by a new automorphism of ordered trees, we prove that the statistic ‘number of exterior pairs’, introduced by A. Denise and R. Simion, on the set Cn is equidistributed with the statistic ‘number of up steps at height h with h ≡ 0 (mod 3)’. Moreover, for m ≥ 3, we prove that the two statistics ‘number of up steps at height h with h ≡ 0 (mod m)’ and ‘number of up steps at height h with h ≡ m − 1 (mod m)’ on the set Cn are ‘almost equidistributed’. Both results are proved combinatorially.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pairs of noncrossing free Dyck paths and noncrossing partitions

Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n and noncrossing partitions of [2n + 1] with n + 1 blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm.

متن کامل

Dyck path statistics

A wide range of articles dealing with the occurrence of strings in Dyck paths appear frequently in the literature [2], [3], [5], [6], [7] and [11]. A Dyck path of semilength n is a lattice path of N2 running from (0, 0) to (2n, 0), whose allowed steps are the up diagonal step (1, 1) and the down diagonal step (1,−1). These steps are called rise and fall respectively. It is clear that each Dyck ...

متن کامل

How to decompose a permutation into a pair of labeled Dyck paths by playing a game

We give a bijection between permutations of 1, . . . , 2n and certain pairs of Dyck paths with labels on the down steps. The bijection arises from a game in which two players alternate selecting from a set of 2n items: the permutation encodes the players’ preference ordering of the items, and the Dyck paths encode the order in which items are selected under optimal play. We enumerate permutatio...

متن کامل

A Simple and Unusual Bijection for Dyck Paths and Its Consequences Sergi Elizalde and Emeric Deutsch

In this paper we introduce a new bijection from the set of Dyck paths to itself. This bijection has the property that it maps statistics that appeared recently in the study of pattern-avoiding permutations into classical statistics on Dyck paths, whose distribution is easy to obtain. We also present a generalization of the bijection, as well as several applications of it to enumeration problems...

متن کامل

Counting Segmented Permutations Using Bicoloured Dyck Paths

A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red and green. We say that a permutation π is σ-segmented if every occurrence o of σ in π is a segment-occurrence (i.e., o is a contiguous subword in π). We show combinatorially the following results: The 132-segmented permutations of length n with k occurrences of 132 are in one-to-one corresponden...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2011